A bijection for essentially 3-connected toroidal maps

نویسندگان

چکیده

We present a bijection for toroidal maps that are essentially 3-connected (3-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite with all faces of degree 4 except hexagonal root-face. show these well-characterized unicellular maps. bijection, to recent one by Bonichon and Lévêque 4-connected triangulations, can be seen as counterpart developed case Fusy, Poulalhon Schaeffer, it extends recently proposed Fusy simple triangulations. Moreover, we rooted decomposed into two pieces, part is treated our above-mentioned bijection. This yields combinatorial derivation bivariate generating function maps, counted vertices faces.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bijection for essentially 4-connected toroidal triangulations

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorithm, random generation, enumeration. . . ). In this paper we introduce and study a generalization of these objects for the toroidal case. Contrary to...

متن کامل

Every 3-connected, essentially 11-connected line graph is Hamiltonian

Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G−X has at least two non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjác̆ek’s line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is Hamiltonian. © 2005 Elsevier Inc. All rights...

متن کامل

A Bijection for Unicellular Partitioned Bicolored Maps

In the present paper we construct a bijection that relates a set CN,p,q of unicellular partitioned bicolored maps to a set of couples (t, σ) of ordered bicolored trees and partial permutations. This bijection allows us to derive an elegant formula for the enumeration of unicellular bicolored maps, an analogue of the well-known Harer-Zagier result for unicolored one-face maps. Résumé. Dans cet a...

متن کامل

A bijection for nonorientable general maps

We give a different presentation of a recent bijection due to Chapuy and Dołęga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps. This can be seen as a Bouttier–Di Francesco–Guitter-like generalization of the Cori–Vauquelin– Schaeffer bijection in the context of general nonorientable surfaces. In the particular case of triangulations, the e...

متن کامل

5-Connected Toroidal Graphs are Hamiltonian-Connected

The problem on the Hamiltonicity of graphs is well studied in discrete algorithm and graph theory, because of its relation to traveling salesman problem (TSP). Starting with Tutte’s result, stating that every 4-connected planar graph is Hamiltonian, several researchers have studied the Hamiltonicity of graphs on surfaces. Extending Tutte’s technique, Thomassen proved that every 4-connected plan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2021

ISSN: ['1095-9971', '0195-6698']

DOI: https://doi.org/10.1016/j.ejc.2020.103290